package leetcode;

import org.junit.Test;

import java.util.ArrayList;

/**
 * @author Liangyaoyun
 */
public class SearchForTwoDimensionalMatrices {
    public int searchMatrix(int[][] matrix, int target) {
        int x=matrix.length;
        int y=matrix[0].length;
        int i=0;
        int j=0;
        boolean flag=false;
        while (matrix[i][j]<target){
            if (matrix[i][j+1]<target){

            }
        }
        return y;
    }
    @Test
    public void test01(){
        int[][] matrix={{1,4,7,11,15},{2,5,8,12,19},{3,6,9,16,22},{10,13,14,17,24},{18,21,23,26,30}};
        System.out.println(searchMatrix(matrix,0));
    }
}
